Efficient Algebraic Method for Testing the Invertibility of Finite State Machines

The emergence of new embedded system technologies, such as IoT, requires the design lightweight cryptosystems to meet different hardware restrictions. In this context, concept Finite State Machines (FSMs) can offer a robust solution when using based on finite automata, known FAPKC (Finite Automaton Public Key Cryptosystems), introduced by Renji Tao. These have been proposed alternatives traditional public key cryptosystems, RSA. They are composing two private keys, which FSMs M1 and M2 with property invertibility delay obtain composed FSM M=M1oM2, is key. invert process (factorizing) hard compute. Unfortunately, these not really adopted in real-world applications, mainly due lack profound studies space random generator program. paper, we first introduce an efficient algebraic method notion testing table compute FSM. Then, carry out statistical study number invertible varying states well output symbols. This allows us estimate landscape FSMs, considered step toward generator.